Quantum walks of interacting fermions on a cycle graph
نویسندگان
چکیده
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In this work quantum walks of electrons on a graph are studied. The graph is composed of semiconductor quantum dots arranged in a circle. Electrons can tunnel between adjacent dots and interact via Coulomb repulsion, which leads to entanglement. Fermionic entanglement dynamics is obtained and evaluated.
منابع مشابه
Two-particle quantum walks applied to the graph isomorphism problem
We show that the quantum dynamics of interacting and noninteracting quantum particles are fundamentally different in the context of solving a particular computational problem. Specifically, we consider the graph isomorphism problem, in which one wishes to determine whether two graphs are isomorphic (related to each other by a relabeling of the graph vertices), and focus on a class of graphs wit...
متن کاملMixing and Decoherence in Continuous-time quantum walks on long-range interacting cycles
We study the effect of small decoherence in continuous-time quantum walks on long-range interacting cycles (LRICs), which are constructed by connecting all the two nodes of distance m in the cycle graph. In our investigation, each node is continuously monitored by an individual point contact (PC), which induces the decoherence process. We obtain the analytical probability distribution and the m...
متن کاملجابهجایی انرژی فرمیونهای غیرنسبیتی برهمکنش کننده در فضای ناجابهجاگر
A local interaction in noncommutative space modifies to a non-local one. For an assembly of particles interacting through the contact potential, formalism of the quantum field theory makes it possible to take into account the effect of modification of the potential on the energy of the system. In this paper we calculate the energy shift of an assembly of non-relativistic fermions, interacting...
متن کاملNoninteracting multiparticle quantum random walks applied to the graph isomorphism problem for strongly regular graphs
We investigate the quantum dynamics of particles on graphs (“quantum random walks”), with the aim of developing quantum algorithms for determining if two graphs are isomorphic (related to each other by a relabeling of vertices). We focus on quantum random walks of multiple noninteracting particles on strongly regular graphs (SRGs), a class of graphs with high symmetry that is known to have pair...
متن کاملMixing in Continuous Quantum Walks on Graphs
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs th...
متن کامل